Implementing Reflection in Nuprl
نویسنده
چکیده
Syntax : Syntax represented as data, similar to concrete syntax, except that irrelevant features are abstracted away. For this work, this is exactly like concrete syntax modulo alpha-equality. (Note that the “abstract” here is unrelated to functions, it is only to distinguished the represented syntax from the actual syntax.) Higher Order Abstract Syntax, HOAS : Similar to abstract syntax, except that binders are encoded using meta-level binders (usually functions). Appendix B Theory Files The reflection theory is summarized in this appendix for reference. It is generated by Nuprl. B.1 Reflection Theory REFLECTION __________ *C reflection_begin ************ REFLECTION ************ *C begin_term ---------term ---------*D term EdAlias Term :: Term== term *R termFormation H ` U ext Term
منابع مشابه
Reflecting Higher-Order Abstract Syntax in Nuprl
This document describes part of an effort to achieve in Nuprl a practical reflection of its expression syntax. This reflection is done at the granularity of the operators; in particular, each operator of the syntax is denoted by another operator of the same syntax. Further, the syntax has binding operators, and we organize reflection not around the concrete binding syntax, but instead, around t...
متن کاملPractical Reflection in Nuprl
We present an implementation of reflection for the Nuprl theorem prover, based on combining intuitions from programming languages and logical languages. We reflect a logical language, adapting the common practice from Lisp dialects of avoiding redundant coding whenever it is possible to expose internal functionality. In particular, concepts of the logical language such as term syntax and substi...
متن کاملImplementing mathematics with the Nuprl proof development system
In undergoing this life, many people always try to do and get the best. New knowledge, experience, lesson, and everything that can improve the life will be done. However, many people sometimes feel confused to get those things. Feeling the limited of experience and sources to be better is one of the lacks to own. However, there is a very simple thing that can be done. This is what your teacher ...
متن کاملPredicate Transformers for Infinite-State Automata in NuPRL Type Theory
This paper has two goals. The first is to present a formalization in Nuprl type theory of a very general methodology for system description, specification and verification. The method is especially suitable for describing distributed systems, and is based on a modification of the I/O automata of Lynch & Tuttle. By using infinite extendible records as the state spaces of automata we gain a key i...
متن کاملHow to believe a Nuprl Proof: checking Nuprl proofs in ACL2
Stipulations on the correctness of proofs produced in a formal system include that the axioms and proof rules are the intended ones and that the proof has been properly constructed (i.e. it is a correct instantiation of the axioms and proof rules.) In software implementations of formal systems, correctness additionally depends both on the correctness of the program implementing the system and o...
متن کامل